Convexities Related to Path Properties on Graphs; a Unified Approach
نویسندگان
چکیده
Path properties, such as ’geodesic’, ’induced’, ’all paths’ define a convexity on a connected graph. The general notion of path property, introduced in this paper, gives rise to a comprehensive survey of results obtained by different authors for a variety of path properties, together with a number of new results. We pay special attention to convexities defined by path properties on graph products and the classical convexity invariants, such as the Carathéodory, Helly and Radon numbers in relation with graph invariants, such as clique numbers and other graph properties. ∗The research for this paper was mainly done while this author was visiting the Econometric Institute of Erasmus University, Rotterdam and the University of Groningen as a BOYSCAST fellow of the Department of Science and Technology (DST) of the Ministry of Science and Technology of India in 1998. The financial support of the DST, New Delhi, and the University of Groningen, and the hospitality of the Econometric Institute, Rotterdam, are greatly acknowledged.
منابع مشابه
Convexities related to path properties on graphs
A feasible family of paths in a connected graphG is a family that contains at least one path between any pair of vertices in G. Any feasible path family defines a convexity on G. Well-known instances are: the geodesics, the induced paths, and all paths. We propose a more general approach for such ‘path properties’. We survey a number of results from this perspective, and present a number of new...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملOn triangle path convexity in graphs
Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved
متن کاملA general framework for path convexities
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity ; and there are many other examples. Besides reviewing the path convexities in the literature, ...
متن کاملEstimating all pairs shortest paths in restricted graph families : a unified approach ✩ Feodor
In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997